A family of random trees with random edge lengths
نویسندگان
چکیده
منابع مشابه
A family of random trees with random edge lengths
We introduce a family of probability distributions on the space of trees with I labeled vertices and possibly extra unlabeled vertices of degree 3, whose edges have positive real lengths. Formulas for distributions of quantities such as degree sequence, shape, and total length are derived. An interpretation is given in terms of sampling from the inhomogeneous continuum random tree of Aldous and...
متن کاملMinimal Spanning Trees for Graphs with Random Edge Lengths
The theory of the minimal spanning tree (MST) of a connected graph whose edges are assigned lengths according to independent identically distributed random variables is developed from two directions. First, it is shown how the Tutte polynomial for a connected graph can be used to provide an exact formula for the length of the minimal spanning tree under the model of uniformly distributed edge l...
متن کاملLocalization on quantum graphs with random edge lengths
The spectral properties of the Laplacian on a class of quantum graphs with random metric structure are studied. Namely, we consider quantum graphs spanned by the simple Z-lattice with δ-type boundary conditions at the vertices, and we assume that the edge lengths are randomly independently identically distributed. Under the assumption that the coupling constant at the vertices does not vanish, ...
متن کاملThe scaling of the minimum sum of edge lengths in uniformly random trees
The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial time, they have remained theoretical and have not been implemented in practical contexts to our knowledge. Here we use one of those algorithms to investigat...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 1999
ISSN: 1042-9832,1098-2418
DOI: 10.1002/(sici)1098-2418(199909)15:2<176::aid-rsa4>3.0.co;2-4